Polynomial Time Verification of Modular Diagnosability of Discrete Event Systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A polynomial algorithm for testing diagnosability of discrete-event systems

Failure diagnosis in large and complex systems is a critical task. In the realm of discrete event systems, Sampath et al. proposed a language based failure diagnosis approach. They introduced the diagnosability for discrete event systems and gave a method for testing the diagnosability by first constructing a diagnoser for the system. The complexity of this method of testing diagnosability is e...

متن کامل

Diagnosability of Discrete Event Systems with Modular Structure

The diagnosis of unobservable faults in large and complex discrete event systems modeled by parallel composition of automata is considered. A modular approach is developed for diagnosing such systems. The notion of modular diagnosability is introduced and the corresponding necessary and sufficient conditions to ensure it are presented. The verification of modular diagnosability is performed by ...

متن کامل

Comments on "Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems" versus "Decentralized Failure Diagnosis of Discrete Event Systems": Complexity Clarification

An article on codiagnosability verification of discrete event systems was reported in [1], claiming an improvement in complexity over [2]. This note clarifies an oversight in the complexity analysis of [1]. Further the results of [1] were obtained in a more restricted setting of “projection masks”, in contrast to the more general “nonprojection masks” allowed in [2], which was overlooked. Final...

متن کامل

Virtual Modules in Discrete-Event Systems: Achieving Modular Diagnosability

This paper deals with the problem of enforcing modular diagnosability for discrete-event systems that don’t satisfy this property by their natural modularity. We introduce an approach to achieve this property combining existing modules into new virtual modules. An underlining mathematical problem is to find a partition of a set, such that the partition satisfies the required property. The time ...

متن کامل

Diagnosability Analysis of Distributed Discrete Event Systems

This paper addresses the diagnosability problem of distributed discrete event systems. Until now, the problem of diagnosability has always been solved by considering centralised approaches, monolithic systems. These approaches do not use the fact that real monitored systems are generally modelled in a distributed manner. In this paper, we propose a framework for the diagnosability analysis of s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2017

ISSN: 2405-8963

DOI: 10.1016/j.ifacol.2017.08.2387